Explaining the implicit negations effect in conditional inference: Experience, probabilities, and contrast sets.

نویسندگان

چکیده

Psychologists are beginning to uncover the rational basis for many of biases revealed over last 50 years in deductive and causal reasoning, judgment, decision making. In this article, it is argued that a manipulation, experiential learning, shown be effective judgment making, may elucidate underpinning implicit negation effect conditional inference. three experiments, was created removed by using probabilistically structured contrast sets acquired during brief learning phase. No other theory negations predicts these results, which can modeled Bayes nets as approaches category structure. It also how results relate recent development psychology reasoning called inferentialism. concluded same cognitive mechanisms underpin making common logical require no special purpose machinery or module. (PsycInfo Database Record (c) 2020 APA, all rights reserved).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilities and polarity biases in conditional inference.

A probabilistic computational level model of conditional inference is proposed that can explain polarity biases in conditional inference (e.g., J. St. B. T. Evans, 1993). These biases are observed when J. St. B. T. Evans's (1972) negations paradigm is used in the conditional inference task. The model assumes that negations define higher probability categories than their affirmative counterparts...

متن کامل

Inference in Polytrees with Sets of Probabilities

Inferences in directed acyclic graphs associated with probability intervals and sets of probabil­ ities are NP-hard, even for polytrees. We pro­ pose: I) an improvement on Tessem's AIR algo­ rithm for inferences on polytrees associated with probability intervals; 2) a new algorithm for ap­ proximate inferences based on local search; 3) branch-and-bound algorithms that combine the previous techn...

متن کامل

Inference with Seperately Specified Sets of Probabilities in Credal Networks

We present new algorithms for inference in credal networksdirected acyclic graphs asso­ ciated with sets of probabilities. Credal networks are here interpreted as encoding strong indepen­ dence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this set­ ting. We th...

متن کامل

A simplified algorithm for inference by lower conditional probabilities

Thanks to the notion of locally strong coherence, the satisfiability of proper logical conditions on subfamilies of the initial domain helps to simplify inferential processes based on lower conditional assessments. Actually, these conditions avoid also round errors that, on the other hand, appear solving numerical systems. In this paper we introduce new conditions to be applied to sets of parti...

متن کامل

Calculating Uncertainty Intervals from Conditional Convex Sets of Probabilities

In Moral, Campos (1991) and Cano, Moral, Verdegay-L6pez (1991) a new method of con­ ditioning convex sets of probabilities has been proposed. The result of it is a convex set of non-necessarily normalized probability dis­ tributions. The normalizing factor of each probability distribution is interpreted as the possibility assigned to it by the conditioning information. From this, it is deduced ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Experimental Psychology: General

سال: 2021

ISSN: ['0096-3445', '1939-2222']

DOI: https://doi.org/10.1037/xge0000954